现有的kg增强模型用于问题回答主要专注于设计精心图形神经网络（GNN）以模拟知识图（KG）。但是，它们忽略了（i）有效地融合和推理过问题上下文表示和kg表示，并且（ii）在推理期间自动从嘈杂的KG中选择相关节点。在本文中，我们提出了一种新颖的型号，其通过LMS和GNN的联合推理和动态KGS修剪机制解决了上述限制。具体而言，ConntLK通过新的密集双向注意模块在LMS和GNN之间执行联合推理，其中每个问题令牌参加KG节点，每个KG节点都会参加问题令牌，并且两个模态表示熔断和通过多次熔断和更新。步互动。然后，动态修剪模块使用通过联合推理产生的注意重量来递归修剪无关的kg节点。我们在CommanSENSEQA和OpenBookQA数据集上的结果表明，我们的模态融合和知识修剪方法可以更好地利用相关知识来推理。

机器学习模型在许多领域都表现出了有希望的表现。但是，担心他们可能会偏向特定的群体，阻碍了他们在高级申请中的采用。因此，必须确保机器学习模型中的公平性。以前的大多数努力都需要访问敏感属性以减轻偏见。尽管如此，由于人们对隐私和法律依从性的认识日益增加，获得具有敏感属性的大规模数据通常是不可行的。因此，一个重要的研究问题是如何在隐私下做出公平的预测？在本文中，我们研究了半私人环境中公平分类的新问题，其中大多数敏感属性都是私有的，只有少量的干净敏感属性可用。为此，我们提出了一个新颖的框架Fairsp，可以首先学会通过利用有限的清洁敏感属性来纠正隐私保证下的嘈杂敏感属性。然后，它以对抗性方式共同建模校正和清洁数据以进行歧义和预测。理论分析表明，当大多数敏感属性都是私有的时，提出的模型可以确保公平。现实世界数据集的实验结果证明了所提出的模型在隐私下做出公平预测并保持高精度的有效性。

多对象跟踪（MOT）需要通过帧检测和关联对象。与通过检测到的边界框或将对象作为点跟踪不同，我们建议跟踪对象作为像素分布。我们将此想法实例化，以基于变压器的体系结构P3Aformer，并具有像素的传播，预测和关联。P3Aformer通过流量信息引导的Pixel-Pixel特征，以传递帧之间的消息。此外，P3Aformer采用元结构结构来生成多尺度对象特征图。在推断期间，提出了一个像素关联过程，以基于像素的预测来通过帧恢复对象连接。P3Aformer在MOT17基准上的MOTA中产生81.2 \％，这是所有变压器网络中第一个达到文献中80 \％MOTA。P3AFORMER在MOT20和Kitti基准测试上也优于最先进的。

现代机器学习（ML）模型越来越流行，并广泛用于决策系统。但是，研究表明，ML歧视和不公平性的关键问题阻碍了他们对高级应用程序的采用。对公平分类器的最新研究引起了人们的重大关注，以开发有效的算法以实现公平性和良好的分类性能。尽管这些公平感知到的机器学习模型取得了巨大的成功，但大多数现有模型都需要敏感属性来预处理数据，将模型学习正规化或后处理预测以具有公平的预测。但是，由于隐私，法律或法规限制，敏感属性通常是不完整甚至不可用的。尽管我们缺乏训练目标域中公平模型的敏感属性，但可能存在具有敏感属性的类似域。因此，重要的是从类似域中利用辅助信息，以帮助改善目标域中的公平分类。因此，在本文中，我们研究了探索域适应以进行公平分类的新问题。我们提出了一个新框架，可以同时估算目标域中的公平分类器时，可以同时估算敏感属性。现实世界数据集的广泛实验说明了提出的公平分类模型的有效性，即使目标域中没有敏感属性。

人员搜索是一个有关的任务，旨在共同解决人员检测和人员重新识别（RE-ID）。虽然最先前的方法侧重于学习稳健的个人功能，但由于照明，大构成方差和遮挡，仍然很难区分令人困惑的人。上下文信息实际上是人们搜索任务，这些任务在减少混淆方面搜索。为此，我们提出了一个名为注意上下文感知嵌入（ACAE）的新颖的上下文特征头，这增强了上下文信息。 Acae反复审查图像内部和图像内的该人员，以查找类似的行人模式，允许它隐含地学会找到可能的共同旅行者和有效地模范上下文相关的实例的关系。此外，我们提出了图像记忆库来提高培训效率。实验上，ACAE在基于不同的一步法时显示出广泛的促销。我们的整体方法实现了最先进的结果与先前的一步法。

推荐系统预测用户在项目中的潜在兴趣，其中核心是学习用户/项目嵌入品。然而，它遭受了数据稀疏问题，跨域推荐可以缓解。但是，大多数事先有效共同学习源域和目标域模型，或者需要侧面特征。然而，由于学习的嵌入由包含偏置信息的源域主导，共同训练和侧面特征将影响目标域上的预测。受到当代艺术在图形表示学习的预训练中的启发，我们提出了一种用于跨域推荐的预先训练和微调图。我们设计了一种用于跨域推荐（PCREC）的新型预训练图神经网络，其采用了图形编码器的对比自我监督的预训练。然后，我们传输预先训练的图形编码器以初始化目标域上的节点嵌入，这有益于目标域上的单个域推荐系统的微调。实验结果表明了PCRec的优越性。详细分析验证了PCRec在传输信息中的优越性，同时避免来自源域的偏差。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

Given the increasingly intricate forms of partial differential equations (PDEs) in physics and related fields, computationally solving PDEs without analytic solutions inevitably suffers from the trade-off between accuracy and efficiency. Recent advances in neural operators, a kind of mesh-independent neural-network-based PDE solvers, have suggested the dawn of overcoming this challenge. In this emerging direction, Koopman neural operator (KNO) is a representative demonstration and outperforms other state-of-the-art alternatives in terms of accuracy and efficiency. Here we present KoopmanLab, a self-contained and user-friendly PyTorch module of the Koopman neural operator family for solving partial differential equations. Beyond the original version of KNO, we develop multiple new variants of KNO based on different neural network architectures to improve the general applicability of our module. These variants are validated by mesh-independent and long-term prediction experiments implemented on representative PDEs (e.g., the Navier-Stokes equation and the Bateman-Burgers equation) and ERA5 (i.e., one of the largest high-resolution data sets of global-scale climate fields). These demonstrations suggest the potential of KoopmanLab to be considered in diverse applications of partial differential equations.

Rankings are widely collected in various real-life scenarios, leading to the leakage of personal information such as users' preferences on videos or news. To protect rankings, existing works mainly develop privacy protection on a single ranking within a set of ranking or pairwise comparisons of a ranking under the $\epsilon$-differential privacy. This paper proposes a novel notion called $\epsilon$-ranking differential privacy for protecting ranks. We establish the connection between the Mallows model (Mallows, 1957) and the proposed $\epsilon$-ranking differential privacy. This allows us to develop a multistage ranking algorithm to generate synthetic rankings while satisfying the developed $\epsilon$-ranking differential privacy. Theoretical results regarding the utility of synthetic rankings in the downstream tasks, including the inference attack and the personalized ranking tasks, are established. For the inference attack, we quantify how $\epsilon$ affects the estimation of the true ranking based on synthetic rankings. For the personalized ranking task, we consider varying privacy preferences among users and quantify how their privacy preferences affect the consistency in estimating the optimal ranking function. Extensive numerical experiments are carried out to verify the theoretical results and demonstrate the effectiveness of the proposed synthetic ranking algorithm.

Due to their ability to offer more comprehensive information than data from a single view, multi-view (multi-source, multi-modal, multi-perspective, etc.) data are being used more frequently in remote sensing tasks. However, as the number of views grows, the issue of data quality becomes more apparent, limiting the potential benefits of multi-view data. Although recent deep neural network (DNN) based models can learn the weight of data adaptively, a lack of research on explicitly quantifying the data quality of each view when fusing them renders these models inexplicable, performing unsatisfactorily and inflexible in downstream remote sensing tasks. To fill this gap, in this paper, evidential deep learning is introduced to the task of aerial-ground dual-view remote sensing scene classification to model the credibility of each view. Specifically, the theory of evidence is used to calculate an uncertainty value which describes the decision-making risk of each view. Based on this uncertainty, a novel decision-level fusion strategy is proposed to ensure that the view with lower risk obtains more weight, making the classification more credible. On two well-known, publicly available datasets of aerial-ground dual-view remote sensing images, the proposed approach achieves state-of-the-art results, demonstrating its effectiveness. The code and datasets of this article are available at the following address: https://github.com/gaopiaoliang/Evidential.